Deterministic Dynamic Matching in O(1) Update Time
نویسندگان
چکیده
منابع مشابه
Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solom...
متن کاملFully dynamic maximal matching in O(log n) update time : with revised and corrected analysis
Baswana, Gupta and Sen [1] had presented a fully dynamic algorithm for maximal matching which achieved O(log n) expected amortized time per edge insertion or deletion. Moreover, for any sequence of t edge updates, the total time taken by the algorithm is O(t log n + n log n) with high probability. Unfortunately, the analysis given in [1] has a crucial flaw, viz., the statement of Lemma 4.10 [1]...
متن کاملA deterministic dynamic element matching approach to ADC testing
A deterministic dynamic element matching (DEM) approach to ADC testing is introduced and compared with a common random DEM method. With both approaches, a highly non-ideal DAC is used to generate an excitation for a DUT that has linearity that far exceeds that of the test stimulus. Simulation results show that both methods can be used for testing of ADCs but with a substantial reduction in the ...
متن کاملDeterministic Fully Dynamic Data Structures for Vertex Cover and Matching
We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph G = (V,E), with |V | = n and |E| = m, in o( √ m ) time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2+ ) approximation inO(log n/ ) amortized time per update. For maximum matching, we ...
متن کاملDeterministic Dynamic Monitors for Linear-Time Assertions
We describe a framework for dynamic verification of temporal assertions based on assertion compilation into deterministic automata. The novelty of our approach is that it allows efficient dynamic verification of general linear temporal formulas written in formal property specification languages such as LTL, ForSpec, PSL, and SVA, while the existing approaches are applicable to limited subsets o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2019
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-019-00630-4